Constrained second order optimization on non-archimedean fields
نویسندگان
چکیده
منابع مشابه
Constrained Second Order Optimization on Non-archimedean Fields
Constrained optimization on non-Archimedean fields is presented. We formalize the notion of a tangent plane to the surface defined by the constraints making use of an implicit function Theorem similar to its real counterpart. Then we derive necessary and sufficient conditions of second order for the existence of a local minimizer of a function subject to a set of equality and inequality constra...
متن کاملOne-dimensional Optimization on Non-archimedean Fields
One dimensional optimization on non-Archimedean fields is presented. We derive first and second order necessary and sufficient optimality conditions. For first order optimization, these conditions are similar to the corresponding real ones; but this is not the case for higher order optimization. This is due to the total disconnectedness of the given non-Archimedean field in the order topology, ...
متن کاملNontrivial order preserving automorphisms of non-Archimedean fields
A study of order preserving field automorphisms of ordered nonArchimedean field extensions of R will be presented. We show that, while the identity map is the only field automorphism of R, infinitely many nontrivial order preserving field automorphisms can be constructed on an ordered nonArchimedean field extension F of R. Moreover, we show that if P is an order preserving field automorphism of...
متن کاملGlobal Newton Iteration over Archimedean and non-Archimedean Fields
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically convergent iterations: the first one involves Newton iteration applied to the approximate roots individually and then interpolation to find the RUR of these approx...
متن کاملConvergence to Second Order Stationary Points in Inequality Constrained Optimization
We propose a new algorithm for the nonlinear inequality constrained minimization problem, and prove that it generates a sequence converging to points satisfying the KKT second order necessary conditions for optimality. The algorithm is a line search algorithm using directions of negative curvature and it can be viewed as a non trivial extension of corresponding known techniques from unconstrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2003
ISSN: 0019-3577
DOI: 10.1016/s0019-3577(03)90073-5